Continuous-time quantum walks on semi-regular spidernet graphs via quantum probability theory
نویسندگان
چکیده
منابع مشابه
Continuous-time quantum walks on semi-regular spidernet graphs via quantum probability theory
We analyze continuous-time quantum and classical random walk on spidernet lattices. In the framework of Stieltjes transform, we obtain density of states, which is an efficiency measure for the performance of classical and quantum mechanical transport processes on graphs, and calculate the spacetime transition probabilities between two vertices of the lattice. Then we analytically show that ther...
متن کاملStudy of continuous-time quantum walks on quotient graphs via quantum probability theory
In the present paper, we study the continuous-time quantum walk on quotient graphs. On such graphs, there is a straightforward reduction of problem to a subspace that can be considerably smaller than the original one. Along the lines of reductions, by using the idea of calculation of the probability amplitudes for continuous-time quantum walk in terms of the spectral distribution associated wit...
متن کاملContinuous-time quantum walks on star graphs
In this paper, we investigate continuous-time quantum walk on star graphs. It is shown that quantum central limit theorem for a continuous-time quantum walk on star graphs for N -fold star power graph, which are invariant under the quantum component of adjacency matrix, converges to continuous-time quantum walk on K2 graphs (Complete graph with two vertices) and the probability of observing wal...
متن کاملQuantum Walks on Regular Graphs and Eigenvalues
We study the transition matrix of a quantum walk on strongly regular graphs. It is proposed by Emms, Hancock, Severini and Wilson in 2006, that the spectrum of S+(U3), a matrix based on the amplitudes of walks in the quantum walk, distinguishes strongly regular graphs. We find the eigenvalues of S+(U) and S+(U2) for regular graphs and show that S+(U2) = S+(U)2 + I.
متن کاملMixing in Continuous Quantum Walks on Graphs
Classical random walks on well-behaved graphs are rapidly mixing towards the uniform distribution. Moore and Russell showed that a continuous quantum walk on the hypercube is instantaneously uniform mixing. We show that the continuous-time quantum walks on other well-behaved graphs do not exhibit this uniform mixing. We prove that the only graphs amongst balanced complete multipartite graphs th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Quantum Information Processing
سال: 2009
ISSN: 1570-0755,1573-1332
DOI: 10.1007/s11128-009-0130-0